Graph Embedded Nonparametric Mutual Information for Supervised Dimensionality Reduction
نویسندگان
چکیده
منابع مشابه
Dimensionality reduction for supervised learning
Outline Motivation Dimensionality reduction Experimental setup Results Discussion References Outline Motivation Supervised learning High dimensionality Dimensionality reduction Principal component analysis Random projections Experimental setup Algorithms and datasets Procedure Results Discussion Outline Motivation Dimensionality reduction Experimental setup Results Discussion References Motivat...
متن کاملConstrained Maximum Mutual Information Dimensionality Reduction for Language Identification
In this paper we propose Constrained Maximum Mutual Information dimensionality reduction (CMMI), an informationtheoretic based dimensionality reduction technique. CMMI tries to maximize the mutual information between the class labels and the projected (lower dimensional) features, optimized via gradient ascent. Supervised and semi-supervised CMMI are introduced and compared with a state of the ...
متن کاملA novel supervised dimensionality reduction algorithm: Graph-based Fisher analysis
In this paper, a novel supervised dimensionality reduction (DR) algorithm called graphbased Fisher analysis (GbFA) is proposed. More specifically, we redefine the intrinsic and penalty graph and trade off the importance degrees of the same-class points to the intrinsic graph and the importance degrees of the not-same-class points to the penalty graph by a strictly monotone decreasing function; ...
متن کاملSemi-Supervised Dimensionality Reduction
Dimensionality reduction is among the keys in mining highdimensional data. This paper studies semi-supervised dimensionality reduction. In this setting, besides abundant unlabeled examples, domain knowledge in the form of pairwise constraints are available, which specifies whether a pair of instances belong to the same class (must-link constraints) or different classes (cannot-link constraints)...
متن کاملDimensionality reduction based on non-parametric mutual information
In this paper we introduce a supervised linear dimensionality reduction algorithm which finds a projected input space that maximizes the mutual information between input and output values. The algorithm utilizes the recently introduced MeanNN estimator for differential entropy. We show that the estimator is an appropriate tool for the dimensionality reduction task. Next we provide a nonlinear r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Neural Networks and Learning Systems
سال: 2015
ISSN: 2162-237X,2162-2388
DOI: 10.1109/tnnls.2014.2329240